POLYGONAL WORDS IN FREE GROUPS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automorphic orbits in Free Groups: Words versus Subgroups

We show that the following problems are decidable in rank 2 free groups: does a given finitely generated subgroup H contain primitive elements? and does H meet the automorphic orbit of a given word u? In higher rank, we show the decidability of the following weaker problem: given a finitely generated subgroup H , a word u and an integer k, does H contain the image of u by some k-almost bounded ...

متن کامل

Compressed Words and Automorphisms in Fully Residually Free Groups

We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word problem in the automorphism group of an F-group is decidable in polynomial time.

متن کامل

Image reducing words and subgroups of free groups

A word w over a *nite alphabet is said to be n-collapsing if for an arbitrary *nite automaton A = 〈Q; −·−〉, the inequality |Q ·w|6 |Q| − n holds provided that |Q · u|6 |Q| − n for some word u (depending on A). We give an algorithm to test whether a word is 2-collapsing. To this aim we associate to every word w a *nite family of *nitely generated subgroups in *nitely generated free groups and pr...

متن کامل

Veech Groups and Polygonal Coverings

We discuss branch points of a ne coverings and their e ects on Veech groups. In particular, this allows us to show that even if one polygon tiles another, the respective Veech groups are not necessarily commensurable. We also show that there is no universal bound on the number of Teichm uller disks passing through the same point of Teichm uller space and having incommensurable lattice Veech g...

متن کامل

Fully Residually Free Groups and Graphs Labeled by Infinite Words

Let F = F (X) be a free group with basis X and Z[t] be a ring of polynomials with integer coefficients in t. In this paper we develop a theory of (Z[t], X)-graphs a powerful tool in studying finitely generated fully residually free (limit) groups. This theory is based on the Kharlampovich-Myasnikov characterization of finitely generated fully residually free groups as subgroups of the Lyndon’s ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Quarterly Journal of Mathematics

سال: 2010

ISSN: 0033-5606,1464-3847

DOI: 10.1093/qmath/haq045